根据前序序列:int[] preSort={1,2,4,7,3,5,6,8};
中序序列:int[] inSort=new int[]{4,7,2,1,5,3,8,6};
建立二叉树,求后序遍历等问题。
前序遍历,中序遍历,后序遍历,层次遍历,四种遍历中,必须包含中序遍历+三选一,两个序列就可以恢复出二叉树的形态。
//方案一:
package com.mytest.mymain;
import java.util.Arrays;
//定义节点
class BinaryTree{
public int value;
public BinaryTree leftNode;
public BinaryTree rightNode;
BinaryTree(int x) { value = x; }
}
public class ConstrontTree {
public static void main(String[] args) throws Exception {
int[] preSort={1,2,4,7,3,5,6,8};
int[] inSort=new int[]{4,7,2,1,5,3,8,6};
BinaryTree root=startBuildTree(preSort,inSort);
}
//01递归生成树
private static BinaryTree startBuildTree(int[] preSort,int[] inSort) throws Exception {
//异常判断
if(preSort==null || inSort==null){
return null;
}
if(preSort.length!=inSort.length){
throw new Exception("不满足条件